Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window
نویسندگان
چکیده
منابع مشابه
The Vehicle Routing Problem with Multiple Trips
Non-asset based third-party logistics providers manage fleets of leased vehicles for their customers. Due to high leasing costs, minimizing the number of vehicles employed in daily operations is of primary concern to such firms. Consequently, routings that involve fewer vehicles and potentially longer travel times are favored over routings that involve additional vehicles. Constructing routes t...
متن کاملA Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملThe Time Window Assignment Vehicle Routing Problem
In many distribution networks, it is vital that time windows in which deliveries are made are assigned to customers for the long term. However, at the moment of assigning time windows demand is not known. In this paper we introduce the time window assignment vehicle routing problem, the TWAVRP. In this problem time windows have to be assigned before demand is known. Next the realization of dema...
متن کاملILS with Multiple Variable Neighbourhood Descendent for the Vehicle Routing Problem with Multiple Trips
This paper describes a new approach to solving the vehicle route problem with Multiple Trips. The proposed algorithm (IVNDS) is based on the Iterative Local Search meta-heuristic which uses two consecutive Variable Neighbourhood Descendent (VND) procedures in the improvement phase. The VND procedures are differentiated by the search spaces they explore. The first VND performs moves in routes of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Teknik Industri
سال: 2011
ISSN: 2087-7439,1411-2485
DOI: 10.9744/jti.13.1.1-10